Polychromatic Colorings of n-Dimensional Guillotine-Partitions
نویسنده
چکیده
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors appearing on its corners. A guillotine-partition is obtained by starting with a single axis-parallel hyperbox and recursively cutting a hyperbox of the partition into two hyperboxes by a hyperplane orthogonal to one of the n axes. We prove that there is a strong hyperbox-respecting coloring of any n-dimensional guillotine-partition. This theorem generalizes the result of Horev et al. [8] who proved the 2-dimensional case. This problem is a special case of the n-dimensional variant of polychromatic colorings. The proof gives an efficient coloring algorithm as well.
منابع مشابه
Cut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کاملSeparable d-Permutations and Guillotine Partitions
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2d−1-dimensional bo...
متن کاملPolychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors of general partitions where every subrectangle is required to have all four colors appear on its boundary. It is shown that there exist general partitions that do not admit such a coloring. This answers a question of Di...
متن کاملPolychromatic Colorings on the Hypercube
Given a subgraph G of the hypercube Qn, a coloring of the edges of Qn such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers, it is only necessary to consider a str...
متن کاملLinear Polychromatic Colorings of Hypercube Faces
A coloring of the `-dimensional faces of Qn is called d-polychromatic if every embedded Qd has every color on at least one face. Denote by p `(d) the maximum number of colors such that any Qn can be colored in this way. We provide a new lower bound on p`(d) for ` > 1.
متن کامل